Word Sense Disambiguation by Combining Classifiers with an Adaptive Selection of Context Representation
نویسندگان
چکیده
Word Sense Disambiguation (WSD) is the task of choosing the right sense of a polysemous word given a context. It is obviously essential for many natural language processing applications such as human-computer communication, machine translation, and information retrieval. In recent years, much attention have been paid to improve the performance of WSD systems by using combination of classifiers. In (Kittler, Hatef, Duin, and Matas 1998), six combination rules including product, sum, max, min, median, and majority voting were derived with a number of strong assumptions, that are unrealistic in many situations and especially in text-related applications. This paper considers a framework of combination strategies based on different representations of context in WSD resulting in these combination rules as well, but without the unrealistic assumptions mentioned above. The experiment was done on four words interest, line, hard, serve; on the DSO dataset it showed high accuracies with median and min combination rules.
منابع مشابه
Combining Classifiers with Multi-representation of Context in Word Sense Disambiguation
In this paper, we first argue that various ways of using context in WSD can be considered as distinct representations of a polysemous word under consideration, then all these representations are used jointly to identify the meaning of the target word. Under such a consideration, we can then straightforwardly apply the general framework for combining classifiers developed in Kittler et al. [5] t...
متن کاملAdaptively entropy-based weighting classifiers in combination using Dempster-Shafer theory for word sense disambiguation
In this paper we introduce an evidential reasoning based framework for weighted combination of classifiers for word sense disambiguation (WSD). Within this framework, we propose a new way of defining adaptively weights of individual classifiers based on ambiguity measures associated with their decisions with respect to each particular pattern under classification, where the ambiguity measure is...
متن کاملTrajectory Based Word Sense Disambiguation
Classifier combination is a promising way to improve performance of word sense disambiguation. We propose a new combinational method in this paper. We first construct a series of Naïve Bayesian classifiers along a sequence of orderly varying sized windows of context, and perform sense selection for both training samples and test samples using these classifiers. We thus get a sense selection tra...
متن کاملCombining classifiers for word sense disambiguation based on Dempster-Shafer theory and OWA operators
In this paper, we discuss a framework for weighted combination of classifiers for word sense disambiguation (WSD). This framework is essentially based on DempsterShafer theory of evidence (Dempster, 1967; Shafer, 1976) and ordered weighted averaging (OWA) operators (Yager, 1988). We first determine various kinds of features which could provide complementarily linguistic information for the cont...
متن کاملPKU: Combining Supervised Classifiers with Features Selection
This paper presents the word sense disambiguation system of Peking University which was designed for the SemEval-2007 competition. The system participated in the Web track of task 11 “English Lexical Sample Task via English-Chinese Parallel Text”. The system is a hybrid model by combining two supervised learning algorithms SVM and ME. And the method of entropy-based feature chosen was experimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005